ADMM Penalty Parameter Selection by Residual Balancing
نویسنده
چکیده
Appropriate selection of the penalty parameter is crucial to obtaining good performance from the Alternating Direction Method of Multipliers (ADMM). While analytic results for optimal selection of this parameter are very limited, there is a heuristic method that appears to be relatively successful in a number of different problems. The contribution of this paper is to demonstrate that their is a potentially serious flaw in this heuristic approach, and to propose a modification that at least partially addresses it.
منابع مشابه
Adaptive ADMM with Spectral Penalty Parameter Selection
The alternating direction method of multipliers (ADMM) is a versatile tool for solving a wide range of constrained optimization problems, with differentiable or non-differentiable objective functions. Unfortunately, its performance is highly sensitive to a penalty parameter, which makes ADMM often unreliable and hard to automate for a non-expert user. We tackle this weakness of ADMM by proposin...
متن کاملAdaptive Regularization in Convex Composite Optimization for Variational Imaging Problems
We propose an adaptive parameter balancing scheme in a variational framework where a convex composite energy functional that consists of data fidelity and regularization is optimized. In our adaptive parameter balancing, the relative weight is assigned to each term of the energy for indicating its significance to the total energy, and is automatically determined based on the data fidelity measu...
متن کاملADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization
Alternating direction method of multipliers (ADMM) has received tremendous interest for solving numerous problems in machine learning, statistics and signal processing. However, it is known that the performance of ADMM and many of its variants is very sensitive to the penalty parameter of a quadratic penalty applied to the equality constraints. Although several approaches have been proposed for...
متن کاملFaster Alternating Direction Method of Multipliers with a Worst-case O(1/n) Convergence Rate
The alternating direction method of multipliers (ADMM) is being widely used for various convex programming models with separable structures arising in specifically many scientific computing areas. The ADMM’s worst-case O(1/n) convergence rate measured by the iteration complexity has been established in the literature when its penalty parameter is a constant, where n is the iteration counter. Re...
متن کاملGlobal Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems
The alternating direction method of multipliers (ADMM) has been successfully applied tosolve structured convex optimization problems due to its superior practical performance. Theconvergence properties of the 2-block ADMM have been studied extensively in the literature.Specifically, it has been proven that the 2-block ADMM globally converges for any penaltyparameter γ > 0. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.06209 شماره
صفحات -
تاریخ انتشار 2017